Parameterized complexity of vertex deletion into perfect graph classes
نویسندگان
چکیده
منابع مشابه
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
Vertex deletion problems are at the heart of parameterized complexity. For a graph class F , the F-Deletion problem takes as input a graph G and an integer k. The question is whether it is possible to delete at most k vertices from G such that the resulting graph belongs to F . Whether Perfect Deletion is fixed-parameter tractable, and whether Chordal Deletion admits a polynomial kernel, when p...
متن کاملParameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property
For a class of graphs P, the Bounded P-Block Vertex Deletion problem asks, given a graph G on n vertices and positive integers k and d, whether there is a set S of at most k vertices such that each block of G−S has at most d vertices and is in P. We show that when P satisfies a natural hereditary property and is recognizable in polynomial time, Bounded P-Block Vertex Deletion can be solved in t...
متن کاملParameterized complexity dichotomy for $(r,\ell)$-Vertex Deletion
For two integers r, l ≥ 0, a graph G = (V,E) is an (r, l)graph if V can be partitioned into r independent sets and l cliques. In the parameterized (r, l)-Vertex Deletion problem, given a graph G and an integer k, one has to decide whether at most k vertices can be removed from G to obtain an (r, l)-graph. This problem is NP-hard if r+l ≥ 1 and encompasses several relevant problems such as Verte...
متن کاملParameterized complexity of distances to sparse graph classes
This dissertation offers contributions to the area of parameterized complexity theory, which studies the complexity of computational problems in a multivariate framework. We demonstrate that for graph problems, many popular parameters can be understood as distances that measure how far a graph is from belonging to a class of sparse graphs. We introduce the term distance parameter for such param...
متن کاملParameterized Complexity of Vertex Colouring
For a family F of graphs and a nonnegative integer k, F + ke and F − ke, respectively, denote the families of graphs that can be obtained from F graphs by adding and deleting at most k edges, and F + kv denotes the family of graphs that can be made into F graphs by deleting at most k vertices. This paper is mainly concerned with the parameterized complexity of the vertex colouring problem on F ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.03.013